On mixed Ramsey numbers
نویسندگان
چکیده
For a graph theoretic parameter f, an integer m and a graph H, the mixed Ramsey number r(f‘; m; H) is defined as the least positive integer p such that if G is any graph of order p, then either ,f( G) >m or ?? contains a subgraph isomorphic to H Let /j denote vertex linear arboricity and let H be any connected graph of order n. In this note we show that c(p; m; H ) = 1 + (n + n,,(g) 2)(m l), where np(??) is the path partition number of i?. @ 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملMixed Ramsey numbers: total chromatic number versus stars
Guantao Chen Department of Mathematics and Computing Science Georgia State University ATLANTA GA 30303 USA Given a graph theoretic parameter f, a graph H and a positive integer m, the mixed ramsey number f(m,H) is defmed as the least positive integer p such that for any graph G of order p either f(G) ~ m or G contains H as a subgraph. In this paper we determine the mixed ramsey number X2(m,K( I...
متن کاملAvoidance colourings for small nonclassical Ramsey numbers
The irredundant Ramsey number s = s(m,n) [upper domination Ramsey number u = u(m,n), respectively] is the smallest natural number s [u, respectively] such that in any red-blue edge colouring (R,B) of the complete graph of order s [u, respectively], it holds that IR(B) ≥ m or IR(R) ≥ n [Γ(B) ≥ m or Γ(R) ≥ n, respectively], where Γ and IR denote respectively the upper domination number and the ir...
متن کاملA note on the monotonicity of mixed Ramsey numbers
For two graphs, G and H , an edge coloring of a complete graph is (G,H)-good if there is no monochromatic subgraph isomorphic to G and no rainbow subgraph isomorphic to H in this coloring. The set of numbers of colors used by (G,H)-good colorings of Kn is called a mixed Ramsey spectrum. This note addresses a fundamental question of whether the spectrum is an interval. It is shown that the answe...
متن کاملThe nonclassical mixed domination Ramsey numbers
The nonclassical mixed domination Ramsey number v(m,G) is the smallest integer p such that in every 2-coloring of the edges of Kp with color red and blue, either Γ(B) ≥ m or there exists a blue copy of graph G, where B is the subgraph of Kp induced by blue edges. Γ(G) is the maximum cardinality of a minimal dominating set of a graph G. We give exact values for numbers v(m,K3 − e), v(3, Pm), v(3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 199 شماره
صفحات -
تاریخ انتشار 1999